Finite algebras of finite complexity

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finite algebras of finite complexity

We develop a new centrality concept and apply it to solve certain outstanding problems about nite algebras. In particular, we describe all nite algebras of nite complexity and all nite strongly abelian algebras which generate residually small varieties.

متن کامل

On Some Complexity Problems in Finite Algebras

Dedicated to my wife, Regina, with my everlasting love. ii ACKNOWLEDGMENTS I would like to express my gratitude to a number of people without whose support this thesis would not have been possible. I could not possibly mention all of them. First and foremost I would like to thank my advisor, Professor Ralph McKenzie. I would like to thank him for all the seminars I had the privilege to attend, ...

متن کامل

Radical Cube Zero Selfinjective Algebras of Finite Complexity

One of our main results is a classification all the possible quivers of selfinjective radical cube zero finite dimensional algebras over an algebraically closed field having finite complexity. In the paper [5] we classified all weakly symmetric algebras with support varieties via Hochschild cohomology satisfying Dade’s Lemma. For a finite dimensional algebra to have such a theory of support var...

متن کامل

Classifying the Complexity of Constraints Using Finite Algebras

Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. Here we show that any set of relations used to specify the allowed forms of constraints can be associated with a finite universal algebra and we explore how the com...

متن کامل

Axiomatization of Finite Algebras

We show that the set of all formulas in n variables valid in a finite class A of finite algebras is always a regular tree language, and compute a finite axiom set for A. We give a rational reconstruction of Barzdins’ liquid flow algorithm [BB91]. We show a sufficient condition for the existence of a class A of prototype algebras for a given theory Θ. Such a set allows us to prove Θ |= φ simply ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1999

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(99)00042-4